Probability , Statistics , and Computational Science Niko
نویسنده
چکیده
In this chapter, we review basic concepts from probability theory and computational statistics that are fundamental to evolutionary genomics. We provide a very basic introduction to statistical modeling and discuss general principles, including maximum likelihood and Bayesian inference. Markov chains, hidden Markov models, and Bayesian network models are introduced in more detail as they occur frequently and in many variations in genomics applications. In particular, we discuss efficient inference algorithms and methods for learning these models from partially observed data. Several simple examples are given throughout the text, some of which point to models that are discussed in more detail in subsequent chapters. DOI: https://doi.org/10.1007/978-1-61779-582-4_3 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-80996 Originally published at: Beerenwinkel, Niko; Siebourg, Juliane (2012). Probability, Statistics, and Computational Science. Methods in Molecular Biology, 855:77-110. DOI: https://doi.org/10.1007/978-1-61779-582-4_3 PROBABILITY, STATISTICS, AND COMPUTATIONAL SCIENCE NIKO BEERENWINKEL AND JULIANE SIEBOURG Abstract. In this chapter, we review basic concepts from probability theory and computational statistics that are fundamental to evolutionary genomics. We provide a very basic introduction to statistical modeling and discuss general principles, including maximum likelihood and Bayesian inference. Markov chains, hidden Markov models, and Bayesian network models are introduced in more detail as they occur frequently and in many variations in genomics applications. In particular, we discuss efficient inference algorithms and methods for learning these models from partially observed data. Several simple examples are given throughout the text, some of which point to models that are discussed in more detail in subsequent chapters. In this chapter, we review basic concepts from probability theory and computational statistics that are fundamental to evolutionary genomics. We provide a very basic introduction to statistical modeling and discuss general principles, including maximum likelihood and Bayesian inference. Markov chains, hidden Markov models, and Bayesian network models are introduced in more detail as they occur frequently and in many variations in genomics applications. In particular, we discuss efficient inference algorithms and methods for learning these models from partially observed data. Several simple examples are given throughout the text, some of which point to models that are discussed in more detail in subsequent chapters.
منابع مشابه
A continuous approximation fitting to the discrete distributions using ODE
The probability density functions fitting to the discrete probability functions has always been needed, and very important. This paper is fitting the continuous curves which are probability density functions to the binomial probability functions, negative binomial geometrics, poisson and hypergeometric. The main key in these fittings is the use of the derivative concept and common differential ...
متن کاملConfidence intervals for probabilistic network classifiers
Probabilistic networks (Bayesian networks) are suited as statistical pattern classifiers when the feature variables are discrete. It is argued that their white-box character makes them transparent, a requirement in various applications such as, e.g., credit scoring. In addition, the exact error rate of a probabilistic network classifier can be computed without a dataset. First, the exact error ...
متن کاملArticle Introductory Life Science Mathematics and Quantitative Neuroscience Courses
We describe two sets of courses designed to enhance the mathematical, statistical, and computational training of life science undergraduates at Emory College. The first course is an introductory sequence in differential and integral calculus, modeling with differential equations, probability, and inferential statistics. The second is an upper-division course in computational neuroscience. We pr...
متن کاملStatistics Online Computational Resource for Education.
The Statistics Online Computational Resource (www.SOCR.ucla.edu) provides one of the largest collections of free Internet-based resources for probability and statistics education. SOCR develops, validates and disseminates two core types of materials - instructional resources and computational libraries.
متن کاملProbability-possibility DEA model with Fuzzy random data in presence of skew-Normal distribution
Data envelopment analysis (DEA) is a mathematical method to evaluate the performance of decision-making units (DMU). In the performance evaluation of an organization based on the classical theory of DEA, input and output data are assumed to be deterministic, while in the real world, the observed values of the inputs and outputs data are mainly fuzzy and random. A normal distribution is a contin...
متن کامل